425 research outputs found
Proper Mergings of Stars and Chains are Counted by Sums of Antidiagonals in Certain Convolution Arrays -- The Details
A proper merging of two disjoint quasi-ordered sets and is a
quasi-order on the union of and such that the restriction to or
yields the original quasi-order again and such that no elements of and
are identified. In this article, we determine the number of proper mergings in
the case where is a star (i.e. an antichain with a smallest element
adjoined), and is a chain. We show that the lattice of proper mergings of
an -antichain and an -chain, previously investigated by the author, is a
quotient lattice of the lattice of proper mergings of an -star and an
-chain, and we determine the number of proper mergings of an -star and an
-chain by counting the number of congruence classes and by determining their
cardinalities. Additionally, we compute the number of Galois connections
between certain modified Boolean lattices and chains.Comment: 27 pages, 7 figures, 1 table. Jonathan Farley has solved Problem
4.18; added Section 4.4 to describe his solutio
A Proof of Tarski’s Fixed Point Theorem by Application of Galois Connections
Two examples of Galois connections and their dual forms are considered. One
of them is applied to formulate a criterion when a given subset of a complete lattice forms
a complete lattice. The second, closely related to the first, is used to prove in a short way
the Knaster-Tarski’s fixed point theore
A view of canonical extension
This is a short survey illustrating some of the essential aspects of the
theory of canonical extensions. In addition some topological results about
canonical extensions of lattices with additional operations in finitely
generated varieties are given. In particular, they are doubly algebraic
lattices and their interval topologies agree with their double Scott topologies
and make them Priestley topological algebras.Comment: 24 pages, 2 figures. Presented at the Eighth International Tbilisi
Symposium on Language, Logic and Computation Bakuriani, Georgia, September
21-25 200
Proving Termination Starting from the End
We present a novel technique for proving program termination which introduces
a new dimension of modularity. Existing techniques use the program to
incrementally construct a termination proof. While the proof keeps changing,
the program remains the same. Our technique goes a step further. We show how to
use the current partial proof to partition the transition relation into those
behaviors known to be terminating from the current proof, and those whose
status (terminating or not) is not known yet. This partition enables a new and
unexplored dimension of incremental reasoning on the program side. In addition,
we show that our approach naturally applies to conditional termination which
searches for a precondition ensuring termination. We further report on a
prototype implementation that advances the state-of-the-art on the grounds of
termination and conditional termination.Comment: 16 page
The NESTOR Framework: how to Handle Hierarchical Data Structures
Περιέχει το πλήρες κείμενοIn this paper we study the problem of representing, managing
and exchanging hierarchically structured data in the context of a Digital
Library (DL). We present the NEsted SeTs for Object hieRarchies
(NESTOR) framework defining two set data models that we call: the
“Nested Set Model (NS-M)” and the “Inverse Nested Set Model (INSM)”
based on the organization of nested sets which enable the representation
of hierarchical data structures. We present the mapping between
the tree data structure to NS-M and to INS-M. Furthermore, we shall
show how these set data models can be used in conjunction with Open
Archives Initiative Protocol for Metadata Harvesting (OAI-PMH) adding
new functionalities to the protocol without any change to its basic functioning.
At the end we shall present how the couple OAI-PMH and the
set data models can be used to represent and exchange archival metadata
in a distributed environment
Topos-Theoretic Extension of a Modal Interpretation of Quantum Mechanics
This paper deals with topos-theoretic truth-value valuations of quantum
propositions. Concretely, a mathematical framework of a specific type of modal
approach is extended to the topos theory, and further, structures of the
obtained truth-value valuations are investigated. What is taken up is the modal
approach based on a determinate lattice \Dcal(e,R), which is a sublattice of
the lattice \Lcal of all quantum propositions and is determined by a quantum
state and a preferred determinate observable . Topos-theoretic extension
is made in the functor category \Sets^{\CcalR} of which base category
\CcalR is determined by . Each true atom, which determines truth values,
true or false, of all propositions in \Dcal(e,R), generates also a
multi-valued valuation function of which domain and range are \Lcal and a
Heyting algebra given by the subobject classifier in \Sets^{\CcalR},
respectively. All true propositions in \Dcal(e,R) are assigned the top
element of the Heyting algebra by the valuation function. False propositions
including the null proposition are, however, assigned values larger than the
bottom element. This defect can be removed by use of a subobject
semi-classifier. Furthermore, in order to treat all possible determinate
observables in a unified framework, another valuations are constructed in the
functor category \Sets^{\Ccal}. Here, the base category \Ccal includes all
\CcalR's as subcategories. Although \Sets^{\Ccal} has a structure
apparently different from \Sets^{\CcalR}, a subobject semi-classifier of
\Sets^{\Ccal} gives valuations completely equivalent to those in
\Sets^{\CcalR}'s.Comment: LaTeX2
Completeness for Flat Modal Fixpoint Logics
This paper exhibits a general and uniform method to prove completeness for
certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form
\gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the
language L\sharp (\Gamma) is obtained by adding to the language of polymodal
logic a connective \sharp\_\gamma for each \gamma \epsilon. The term
\sharp\_\gamma (\varphi1, . . ., \varphin) is meant to be interpreted as the
least fixed point of the functional interpretation of the term \gamma(x,
\varphi 1, . . ., \varphi n). We consider the following problem: given \Gamma,
construct an axiom system which is sound and complete with respect to the
concrete interpretation of the language L\sharp (\Gamma) on Kripke frames. We
prove two results that solve this problem. First, let K\sharp (\Gamma) be the
logic obtained from the basic polymodal K by adding a Kozen-Park style fixpoint
axiom and a least fixpoint rule, for each fixpoint connective \sharp\_\gamma.
Provided that each indexing formula \gamma satisfies the syntactic criterion of
being untied in x, we prove this axiom system to be complete. Second,
addressing the general case, we prove the soundness and completeness of an
extension K+ (\Gamma) of K\_\sharp (\Gamma). This extension is obtained via an
effective procedure that, given an indexing formula \gamma as input, returns a
finite set of axioms and derivation rules for \sharp\_\gamma, of size bounded
by the length of \gamma. Thus the axiom system K+ (\Gamma) is finite whenever
\Gamma is finite
Approximating a Behavioural Pseudometric without Discount for<br> Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of
behavioural pseudometrics for probabilistic transition systems. These
pseudometrics are a quantitative analogue of probabilistic bisimilarity.
Distance zero captures probabilistic bisimilarity. Each pseudometric has a
discount factor, a real number in the interval (0, 1]. The smaller the discount
factor, the more the future is discounted. If the discount factor is one, then
the future is not discounted at all. Desharnais et al. showed that the
behavioural distances can be calculated up to any desired degree of accuracy if
the discount factor is smaller than one. In this paper, we show that the
distances can also be approximated if the future is not discounted. A key
ingredient of our algorithm is Tarski's decision procedure for the first order
theory over real closed fields. By exploiting the Kantorovich-Rubinstein
duality theorem we can restrict to the existential fragment for which more
efficient decision procedures exist
Zero-divisor graphs of nilpotent-free semigroups
We find strong relationships between the zero-divisor graphs of apparently
disparate kinds of nilpotent-free semigroups by introducing the notion of an
\emph{Armendariz map} between such semigroups, which preserves many
graph-theoretic invariants. We use it to give relationships between the
zero-divisor graph of a ring, a polynomial ring, and the annihilating-ideal
graph. Then we give relationships between the zero-divisor graphs of certain
topological spaces (so-called pearled spaces), prime spectra, maximal spectra,
tensor-product semigroups, and the semigroup of ideals under addition,
obtaining surprisingly strong structure theorems relating ring-theoretic and
topological properties to graph-theoretic invariants of the corresponding
graphs.Comment: Expanded first paragraph in section 6. To appear in J. Algebraic
Combin. 22 page
- …